Using Knowledge Graph Embedding for Fault Detection

نویسندگان

چکیده

Automotive manufacturers are under stressful timelines as they shift their focus from internal combustion engines (ICE) to electric (EV) and hybrid-electric vehicles (HEV). The demand for this rapid change is crucial meet a growing consumer market. New manufacturing challenges coupled with can lead substantial safety risks consumers well financial liability automakers, especially when recalls happen. resulting misplacement, misalignment, or defective assembly of any the components connectors result in critical even fatal outcomes consumers. Recent findings reported by CNBC revealed that had cost automakers billions dollars (Kolodny 2022). recalling an EV far outweighs ICE. For instance, Ford Kuga plug-in HEV re-calls costs about $19,000 per vehicle, contrast typical ICE vehicle recall averages around $500 (Isidore Vales-Dapena Furthermore, rate has been higher. China’s was approximately 6.9% its total sales volume (Hao et al. 2021).Automakers highly motivated prevent automotive implementing employing several preventative measures. IoT sensor-based fault detection systems, those camera capabilities, have used detect defects during production processes. Industry 4.0 standards (Garofalo 2022) adopted, particularly companies employ autonomous process.A issue vision systems limitations, where only analyze observe end without analyzing relationships possible underlying connections other components. these reveal whether given component missing connected correctly another component. Simply relying on machine examining isolation, uncontrolled environments, becomes difficult reliable, not mention extremely de-manding computational power needed processing.The motivation research work present alternative perspective employs collective view components, represented networked graph, knowledge graph (KG) we hypothesize ability be effective data search faults.KGs collection real-world fact triplets structured form (head, relation, tail) (Hogan Fundamentally, KGs expressed nodes represent sub-components, edges indicate relationship between two adjacent Hence, KG effectively map interconnected after manufacturing. Researchers demonstrated usefulness Knowledge Graph Embedding (KGE) potential solution detection, it advance driving solutions (Bosch Global 2022).This aims at building testing effectiveness detecting faults custom dataset. We implement Completion (KGC) algorithm compare different models. measure Mean Reciprocal Rank (MRR) Hits@K evaluate based various KGE approaches Our our experiments pave new pathway car makers, allowing feasible comprehensive system framework. By combining state-of-the-art models first-hand case study involving dataset (EV-KG), solidifies future KG-related field opens numerous opportunities further development application industry.Link prediction graphs accelerated recent years through works publications, KGE-based methods like RotatE (Bollacker 2008), which allows more accurate efficient (or edges) entities nodes) graph. Specifically, integration link enables analyzed simply individual but made up such vehicle.In method, first embark EV-KG develop all physical relations drawn domain experts manufacturer documentation. A dictionary file built each defined Next, RDF format generated validation. This using (battery_positive_connection, terms-nal_of, battery_cell). take pre-process randomized split into three distinct sets: training dataset, validation Each individually model phases (training dataset) evaluation (validation datasets). score function give candidate triples. represents distance nodes, thus, similar ranking metric, lower score, better. were conducted high-performance cluster compiled specifically vehicle’s layout, factoring parts faulty, will perform experiment. contains 1378 2200 edges, 15 unique relations. tested RotatE, HRotatE, pRotatE, DistMult, ComplEx, TransE modes (Sun al, 2019), found achieved best overall 0.922 [email protected] studying feasibility KG-based system, heavily emphasizes need making environment. Just important accuracy since also affect losses if, example, there too many false negatives positives. One goals make sure choice comes provide early before hands consumer.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantically Smooth Knowledge Graph Embedding

This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...

متن کامل

ProjE: Embedding Projection for Knowledge Graph Completion

With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these mode...

متن کامل

Locally Adaptive Translation for Knowledge Graph Embedding

Knowledge graph embedding aims to represent entities and relations in a large-scale knowledge graph as elements in a continuous vector space. Existing methods, e.g., TransE and TransH, learn embedding representation by defining a global margin-based loss function over the data. However, the optimal loss function is determined during experiments whose parameters are examined among a closed set o...

متن کامل

Context-Dependent Knowledge Graph Embedding

We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...

متن کامل

GAKE: Graph Aware Knowledge Embedding

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... International Florida Artificial Intelligence Research Society Conference

سال: 2023

ISSN: ['2334-0762', '2334-0754']

DOI: https://doi.org/10.32473/flairs.36.133373